WSD as a Distributed Constraint Optimization Problem
نویسندگان
چکیده
This work models Word Sense Disambiguation (WSD) problem as a Distributed Constraint Optimization Problem (DCOP). To model WSD as a DCOP, we view information from various knowledge sources as constraints. DCOP algorithms have the remarkable property to jointly maximize over a wide range of utility functions associated with these constraints. We show how utility functions can be designed for various knowledge sources. For the purpose of evaluation, we modelled all words WSD as a simple DCOP problem. The results are competitive with state-of-art knowledge based systems.
منابع مشابه
Optimal Allocation of Distributed Generation in Microgrid by Considering Load Modeling
Recent increment in carbon emission due to the dependency on fossil fuels in power generation sector is a critical issue in the last decade. The motivation to Distributed Generation (DG) in order to catch low carbon networks is rising. This research seeks to experience DG existence in local energy servicing in microgrid structure. Optimal sizing and placement of DG units is followed by this pap...
متن کاملA Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations
In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
متن کاملProfit maximization solid transportation problem under budget constraint using fuzzy measures
Fixed charge solid transportation problems are formulated as profit maximization problems under a budget constraint at each destination. Here item is purchased in different depots at different prices. Accordingly the item is transported to different destinations from different depots using different vehicles. Unitsare sold from different destinations to the customers at different selling prices...
متن کاملApplying Distributed Constraint Optimization Method to Dynamic Problem
A framework which applies distributed constraint optimization method using depth first search tree to dynamic problem is proposed. The proposed framework is considered as a basic model of multi agent system. The agents communicate with each other to solve the problem. Constraint network for the problem is built. Trees, which are similar to depth first search tree for the constraint network, are...
متن کاملUtilitarian Approach to Privacy in Distributed Constraint Optimization Problems
Privacy has been a major motivation for distributed problem optimization. However, even though several methods have been proposed to evaluate it, none of them is widely used. The Distributed Constraint Optimization Problem (DCOP) is a fundamental model used to approach various families of distributed problems. Here we approach the problem by letting both the optimized costs found in DCOPs and t...
متن کامل